Maximal partial line spreads of non-singular quadrics

For n >= 9 , we construct maximal partial line spreads for non-singular quadrics of for every size between approximately and , for some small constants and . These results are similar to spectrum results on maximal partial line spreads in finite projective spaces by Heden, and by Gacs and SzAnyi. These results also extend spectrum results on maximal partial line spreads in the finite generalized quadrangles and by Pepe, Roing and Storme

A geometric characterisation of Desarguesian spreads

We provide a characterisation of $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$ that have $r$ normal elements in general position. In the same way, we obtain a geometric characterisation of Desarguesian $(n-1)$-spreads in $\mathrm{PG}(rn-1,q)$, $r>2$

Pseudo-ovals in even characteristic and ovoidal Laguerre planes

Pseudo-arcs are the higher dimensional analogues of arcs in a projective plane: a pseudo-arc is a set $\mathcal{A}$ of $(n-1)$-spaces in $\mathrm{PG}(3n-1,q)$ such that any three span the whole space. Pseudo-arcs of size $q^n+1$ are called pseudo-ovals, while pseudo-arcs of size $q^n+2$ are called pseudo-hyperovals. A pseudo-arc is called elementary if it arises from applying field reduction to an arc in $\mathrm{PG}(2,q^n)$. We explain the connection between dual pseudo-ovals and elation Laguerre planes and show that an elation Laguerre plane is ovoidal if and only if it arises from an elementary dual pseudo-oval. The main theorem of this paper shows that a pseudo-(hyper)oval in $\mathrm{PG}(3n-1,q)$, where $q$ is even and $n$ is prime, such that every element induces a Desarguesian spread, is elementary. As a corollary, we give a characterisation of certain ovoidal Laguerre planes in terms of the derived affine planes

Characterisations of elementary pseudo-caps and good eggs

In this note, we use the theory of Desarguesian spreads to investigate good eggs. Thas showed that an egg in $\mathrm{PG}(4n-1, q)$, $q$ odd, with two good elements is elementary. By a short combinatorial argument, we show that a similar statement holds for large pseudo-caps, in odd and even characteristic. As a corollary, this improves and extends the result of Thas, Thas and Van Maldeghem (2006) where one needs at least 4 good elements of an egg in even characteristic to obtain the same conclusion. We rephrase this corollary to obtain a characterisation of the generalised quadrangle $T_3(\mathcal{O})$ of Tits. Lavrauw (2005) characterises elementary eggs in odd characteristic as those good eggs containing a space that contains at least 5 elements of the egg, but not the good element. We provide an adaptation of this characterisation for weak eggs in odd and even characteristic. As a corollary, we obtain a direct geometric proof for the theorem of Lavrauw

Subgeometries in the Andr\'e/Bruck-Bose representation

We consider the Andr\'e/Bruck-Bose representation of the projective plane $\mathrm{PG}(2,q^n)$ in $\mathrm{PG}(2n,q)$. We investigate the representation of $\mathbb{F}_{q^k}$-sublines and $\mathbb{F}_{q^k}$-subplanes of $\mathrm{PG}(2,q^n)$, extending the results for $n=3$ of \cite{BarJack2} and correcting the general result of \cite{BarJack1}. We characterise the representation of $\mathbb{F}_{q^k}$-sublines tangent to or contained in the line at infinity, $\mathbb{F}_q$-sublines external to the line at infinity, $\mathbb{F}_q$-subplanes tangent to and $\mathbb{F}_{q^k}$-subplanes secant to the line at infinity

Identifying codes in vertex-transitive graphs and strongly regular graphs

We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2ln(vertical bar V vertical bar) + 1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that reach both bounds. We exhibit infinite families of vertex-transitive graphs with integer and fractional identifying codes of order vertical bar V vertical bar(alpha) with alpha is an element of{1/4, 1/3, 2/5}These families are generalized quadrangles (strongly regular graphs based on finite geometries). They also provide examples for metric dimension of graphs

The isomorphism problem for linear representations and their graphs

In this paper, we study the isomorphism problem for linear representations. A linear representation Tn*(K) of a point set K is a point-line geometry, embedded in a projective space PG(n+1,q), where K is contained in a hyperplane. We put constraints on K which ensure that every automorphism of Tn*(K) is induced by a collineation of the ambient projective space. This allows us to show that, under certain conditions, two linear representations Tn*(K) and Tn*(K') are isomorphic if and only if the point sets K and K' are PGammaL-equivalent. We also deal with the slightly more general problem of isomorphic incidence graphs of linear representations. In the last part of this paper, we give an explicit description of the group of automorphisms of Tn*(K) that are induced by collineations of PG(n+1,q).Comment: 14 page

Identifying codes in vertex-transitive graphs and strongly regular graphs

We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the size of optimal integer and fractional solutions is between 1 and 2 ln(|V|)+1 where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that reach both bounds. We exhibit infinite families of vertex-transitive graphs with integer and fractional identifying codes of order |V|^a with a in {1/4,1/3,2/5}. These families are generalized quadrangles (strongly regular graphs based on finite geometries). They also provide examples for metric dimension of graphs